Graph isomorphism is polynomial

نویسنده

  • Shmuel Friedland
چکیده

We show that the graph isomorphism problem is determined in a polynomial time. This is done by showing that that two graphs on n vertices are isomorphic if and only if a corresponding system of (4n− 1)n equations in n nonnegative variables is solvable. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Complexity of Matroid Isomorphism Problems

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ 2 . In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is unlikely to be Σ 2 -complete and is coNPhard. We show that when the rank of the matroid is bounded by a constant, linear matroid isomorphism and matroid isomorphism a...

متن کامل

On the Solution of Graph Isomorphism by Dynamical Algorithms

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem ([GN 02], [SJC 03], etc.). In this paper we propose a generalization of an approach exposed in [GN 02] and find that this dynamical algorithm is covered by a combinatorial approach. It is possible to infer that polynomial dynamical algorithms addressing graph isom...

متن کامل

Structural and logical approaches to the graph isomorphism problem

The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NP-complete. The question is still wide open, but a nu...

متن کامل

Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3

The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...

متن کامل

Ip1 Structural and Logical Approaches to the Graph Isomorphism Problem Ip2 Belief Propagation Algorithms: from Matching to Cancer Genomics Cp1 Dimension Reduction for Finite Trees in L1

The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NP-complete. The question is still wide open, but a nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008